Heuristic-Based Approaches for CP-Nets in Negotiation
نویسندگان
چکیده
CP-Nets have proven to be an effective representation for capturing preferences. However, their use in multiagent negotiation is not straightforward. The main reason for this is that CP-Nets capture partial ordering of preferences, whereas negotiating agents are required to compare any two outcomes based on the request and offers. This makes it necessary for agents to generate total orders from their CP-Nets. We have previously proposed a heuristic to generate total orders from a given CP-Net. This paper proposes another heuristic based on Borda count, applies it in negotiation, and compares its performance with the previous heuristic.
منابع مشابه
Multi-player Multi-issue Negotiation with Mediator using CP-nets
This paper presents a simple interactive negotiation approach for conflicts in everyday life with incomplete information. We focus on mediation to obtain an agreement while going through alternating offers over a finite time bargaining game. The mediator searches and proposes a jointly optimal negotiation text for all players participating in the negotiation process based on their conditional p...
متن کاملConditional Preference Networks Support Multi-issue Negotiations with Mediator
Conflicts of interest occur in various aspects of our daily life and we often come to an understanding by negotiating our way through these conflicts. This paper presents a simple interactive negotiation approach to resolve certain conflicts that involve multiple issues. The focus is on mediation to facilitate a solution based on alternating offers over a finite-time bargaining game. The mediat...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملEfficient heuristic approach to dominance testing in CP-nets
CP-net (Conditional Preference Network) is one of the extensively studied languages for representing and reasoning with preferences. The fundamental operation of dominance testing in CP-nets, i.e. determining whether an outcome is preferred to another, is very important in many real-world applications. Current techniques for solving general dominance queries is to search for improving flipping ...
متن کاملAggregating CP-nets with Unfeasible Outcomes
We consider settings where a collection of agents express preferences over a set of candidates with a combinatorial structure via the use of CP-nets, and we need to exploit the information contained in the CP-nets to choose one of the candidates. Moreover, there is a set of constraints which defines the unfeasible candidates, which cannot be the result of the preference aggregation. We propose ...
متن کامل